Constraint graph

Results: 103



#Item
41Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-10-09 05:34:13
42Constraint Design Rewriting Roberto Brunia , Alberto Lluch Lafuenteb , Ugo Montanaria a Dipartimento di Informatica, Universit`a di Pisa, Italy { bruni,ugo}@ di. unipi. it

Constraint Design Rewriting Roberto Brunia , Alberto Lluch Lafuenteb , Ugo Montanaria a Dipartimento di Informatica, Universit`a di Pisa, Italy { bruni,ugo}@ di. unipi. it

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
43Banshee: A Scalable Constraint-Based Analysis Toolkit? John Kodumal1 and Alex Aiken2 1 2

Banshee: A Scalable Constraint-Based Analysis Toolkit? John Kodumal1 and Alex Aiken2 1 2

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-06-06 18:55:41
44Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 10 Self-stabilizing Distributed Constraint Satisfaction ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 10 Self-stabilizing Distributed Constraint Satisfaction ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2000-02-21 01:31:44
45Incremental Analysis of Constraint Logic Programs MANUEL HERMENEGILDO and GERMAN PUEBLA Universidad Polit´ecnica de Madrid KIM MARRIOTT Monash University and

Incremental Analysis of Constraint Logic Programs MANUEL HERMENEGILDO and GERMAN PUEBLA Universidad Polit´ecnica de Madrid KIM MARRIOTT Monash University and

Add to Reading List

Source URL: www.clip.dia.fi.upm.es

Language: English - Date: 2005-07-26 16:20:28
46Journal of Artificial Intelligence Research931  Submitted 01/05; publishedEngineering Note Optiplan: Unifying IP-based and Graph-based Planning

Journal of Artificial Intelligence Research931 Submitted 01/05; publishedEngineering Note Optiplan: Unifying IP-based and Graph-based Planning

Add to Reading List

Source URL: www.menkes76.com

Language: English - Date: 2012-10-29 18:17:44
47Query Answering Exploiting Structural Properties∗ Francesco Scarcello DEIS, Universita` della Calabria, Italy

Query Answering Exploiting Structural Properties∗ Francesco Scarcello DEIS, Universita` della Calabria, Italy

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-07-04 06:02:52
48Filtering Algorithms for the NValue Constraint Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1  LIRMM, CNRS/University of Montpellier, France

Filtering Algorithms for the NValue Constraint Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1 LIRMM, CNRS/University of Montpellier, France

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2010-11-22 06:22:31
49Architectures for Cooperating Constraint Solvers  Alan Borning This material is based upon work supported in part by the National Science Foundation under

Architectures for Cooperating Constraint Solvers Alan Borning This material is based upon work supported in part by the National Science Foundation under

Add to Reading List

Source URL: www.vpri.org

Language: English - Date: 2015-01-21 19:14:21
50Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to

Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to

Add to Reading List

Source URL: asz.informatik.hu-berlin.de

Language: English - Date: 2008-06-05 10:03:31